Comments on "On approximating Euclidean metrics by weighted t-cost distances in arbitrary dimension"

نویسندگان

  • M. Emre Celebi
  • Hassan A. Kingravi
  • Fatih Celiker
چکیده

Mukherjee (Pattern Recognition Letters, vol. 32, pp. 824–831, 2011) recently introduced a class of distance functions called weighted t-cost distances that generalize m-neighbor, octagonal, and t-cost distances. He proved that weighted t-cost distances form a family of metrics and derived an approximation for the Euclidean norm in Z. In this note we compare this approximation to two previously proposed Euclidean norm approximations and demonstrate that the empirical average errors given by Mukherjee are significantly optimistic in R. We also propose a simple normalization scheme that improves the accuracy of his approximation substantially with respect to both average and maximum relative errors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Approximating Metrics by Tree Metrics of Small Distance-Weighted Average Stretch

We study the problem of how well a tree metric is able to preserve the sum of pairwisedistances of an arbitrary metric. This problem is closely related to low-stretch metricembeddings and is interesting by its own flavor from the line of research proposed in theliterature.As the structure of a tree imposes great constraints on the pairwise distances, any embed-ding of a ...

متن کامل

On approximating Euclidean metrics by digital distances in 2D and 3D

In this paper a geometric approach is suggested to ®nd the closest approximation to Euclidean metric based on geometric measures of the digital circles in 2D and the digital spheres in 3D for the generalized octagonal distances. First we show that the vertices of the digital circles (spheres) for octagonal distances can be suitably approximated as a function of the number of neighborhood types ...

متن کامل

Connecting Two Trees with Optimal Routing Cost

We study the problem of finding the optimal connection between two disconnected vertex-weighted trees. We are given a distance function on the vertices and seek to minimize the routing cost of the tree resulting from adding one single edge between the two trees. The routing cost is defined as the sum of the weighted distances between all pairs of vertices in the induced tree-metric. The problem...

متن کامل

Capacity Inverse Minimum Cost Flow Problem under the Weighted Hamming Distances

Given an instance of the minimum cost flow problem, a version of the corresponding inverse problem, called the capacity inverse problem, is to modify the upper and lower bounds on arc flows as little as possible so that a given feasible flow becomes optimal to the modified minimum cost flow problem. The modifications can be measured by different distances. In this article, we consider the capac...

متن کامل

Assessment of the Log-Euclidean Metric Performance in Diffusion Tensor Image Segmentation

Introduction: Appropriate definition of the distance measure between diffusion tensors has a deep impact on Diffusion Tensor Image (DTI) segmentation results. The geodesic metric is the best distance measure since it yields high-quality segmentation results. However, the important problem with the geodesic metric is a high computational cost of the algorithms based on it. The main goal of this ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Pattern Recognition Letters

دوره 33  شماره 

صفحات  -

تاریخ انتشار 2012